Computing Temporal Defeasible Logic
نویسندگان
چکیده
We investigate the complexity of temporal defeasible logic, and propose an efficient algorithm to compute the extension of any theory. The logic and algorithm are discussed in regard to modeling deadlines and normative retroactivity.
منابع مشابه
On the Complexity of Temporal Defeasible Logic
In this paper we investigate the complexity of temporal defeasible logic, and we propose an efficient algorithm to compute the extension of a temporalised defeasible theory. We motivate the logic showing how it can be used to model deadlines.
متن کاملOn the Equivalence of Defeasible Deontic Logic and Temporal Defeasible Logic
In this paper we formally prove that compliance results derived from temporal defeasible logic are equivalent to the ones obtained in the standard defeasible deontic logic. In order to do so we first introduce an operator allowing us to translate rules from the standard to the temporal framework. Then we consider the sets of obligations used in the compliance checking algorithm from [19] and pr...
متن کاملCharacterising Deadlines in Temporal Modal Defeasible Logic
We provide a conceptual analysis of several kinds of deadlines, represented in Temporal Modal Defeasible Logic. The paper presents a typology of deadlines, based on the following parameters: deontic operator, maintenance or achievement, presence or absence of sanctions, and persistence after the deadline. The deadline types are illustrated by a set of examples.
متن کاملRule-Based Agents in Temporalised Defeasible Logic
This paper provides a framework based on temporal defeasible logic to reason about deliberative rule-based cognitive agents. Compared to previous works in this area our framework has the advantage that it can reason about temporal rules. We show that for rule-based cognitive agents deliberation is more than just deriving conclusions in terms of their mental components. Our paper is an extension...
متن کاملImplementing Temporal Defeasible Logic for Modeling Legal Reasoning
In this paper we briefly present an efficient implementation of temporal defeasible logic, and we argue that it can be used to efficiently capture the the legal concepts of persistence, retroactivity and periodicity. In particular, we illustrate how the system works with a real life example of a regulation.
متن کامل